منابع مشابه
Invasion Percolation in Presence of Gravity
Simultaneous capillary dominated displacement of the wetting and non-wetting phases are processes of interest in many disciplines including modeling of the penetration of polluting liquids in hydrology or the secondary migration in petroleum reservoir engineering. Percolation models and in particular invasion percolation is well suited to characterize the slow immiscible displaceme...
متن کاملPresentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کاملWater Flooding Performance Evaluation Using Percolation Theory
Water flooding is a well-known secondary mechanism for improving oil recovery. Conventional approach to evaluate the performance of a water flooding process (e.g. breakthrough and post breakthrough behavior) is to establish a reliable geological reservoir model, upscale it, and then perform flow simulations. To evaluate the uncertainty in the breakthrough time or post breakthrough behavior, thi...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملInterference percolation
Let G be an infinite connected graph with minimum degree δ and maximum degree ∆. Let Gp be a random induced subgraph of G obtained by selecting each vertex of G independently with probability p, 0 < p < 1, and let G≤k p be the induced subgraph of Gp obtained by deleting all vertices of Gp with degree greater than k in Gp. We show that if δ ≥ 6 and ∆/δ is not too large then G≤3 p almost surely h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2011
ISSN: 1083-6489
DOI: 10.1214/ejp.v16-895